Finding k Disjoint Triangles in an Arbitrary Graph
نویسندگان
چکیده
We consider the NP-complete problem of deciding whether an input graph on n vertices has k vertex-disjoint copies of a fixed graph H . For H = K3 (the triangle) we give an O(2 2k log n) algorithm, and for general H an O(2k|H| log k+2k|H| log |H|n|H|) algorithm. We introduce a preprocessing (kernelization) technique based on crown decompositions of an auxiliary graph. For H = K3 this leads to a preprocessing algorithm that reduces an arbitrary input graph of the problem to a graph on O(k) vertices in polynomial time.
منابع مشابه
On edge-disjoint empty triangles of point sets
Let P be a set of points in the plane in general position. Any three points x, y, x 2 P determine a triangle (x, y, z) of the plane. We say that (x, y, z) is empty if its interior contains no element of P . In this paper we study the following problems: What is the size of the largest family of edge-disjoint triangles of a point set? How many triangulations of P are needed to cover all the empt...
متن کاملPacking and Covering Triangles in K 4-free Planar Graphs
We show that every K4-free planar graph with at most ν edge-disjoint triangles contains a set of at most 32ν edges whose removal makes the graph triangle-free. Moreover, equality is attained only when G is the edge-disjoint union of 5-wheels plus possibly some edges that are not in triangles. We also show that the same statement is true if instead of planar graphs we consider the class of graph...
متن کاملPacking triangles in bounded degree graphs
We consider the two problems of finding the maximum number of node disjoint triangles and edge disjoint triangles in an undirected graph. We show that the first (respectively second) problem is polynomially solvable if the maximum degree of the input graph is at most 3 (respectively 4), whereas it is APX-hard for general graphs and NP-hard for planar graphs if the maximum degree is 4 (respectiv...
متن کاملThe upper domatic number of powers of graphs
Let $A$ and $B$ be two disjoint subsets of the vertex set $V$ of a graph $G$. The set $A$ is said to dominate $B$, denoted by $A rightarrow B$, if for every vertex $u in B$ there exists a vertex $v in A$ such that $uv in E(G)$. For any graph $G$, a partition $pi = {V_1,$ $V_2,$ $ldots,$ $V_p}$ of the vertex set $V$ is an textit{upper domatic partition} if $V_i rightarrow V_j$ or $V_j rightarrow...
متن کاملPacking Edge-Disjoint Triangles in Given Graphs
Given a graph G, we consider the problem of finding the largest set of edge-disjoint triangles contained in G. We show that even the simpler case of decomposing the edges of a sparse split graph G into edge-disjoint triangles is NP-complete. We show next that the case of a general G can be approximated within a factor of 3 5 in polynomial time, and is NP-hard to approximate within some constant...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004